Speculative Lock Reordering: Optimistic Out-of-Order Execution of Critical Sections

نویسندگان

  • Peter Rundberg
  • Per Stenström
چکیده

We present a new method – Speculative Lock Reordering (SLR) – that enables multiple threads to concurrently and speculatively execute within a critical section. Its novel feature is to exploit that there is no a priori execution order between separate invocations of a critical section that speculatively executed threads must respect. In contrast to previously proposed speculative synchronization schemes, we show that since an execution order can be selected that removes as many data dependences as possible, SLR can expose more concurrency. Additionally, it is shown that SLR can be implemented in a chip-multiprocessor by only modest extensions to already published thread-level data dependence speculation systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reordered Speculative Execution of Critical Sections

Critical sections can seriously limit the inherent concurrency in a parallel program. One approach to expose more concurrency without imposing more programming effort or synchronization overhead is to speculatively allow multiple threads to access a critical section simultaneously. In this paper we present a new method that allows such speculation. A unique feature of our approach is to take ad...

متن کامل

Implicit Acceleration of Critical Sections via Unsuccessful Speculation

The speculative execution of critical sections, whether done using HTM via the transactional lock elision pattern or using a software solution such as STM or a sequence lock, has the potential to improve software performance with minimal programmer effort. The technique improves performance by allowing critical sections to proceed in parallel as long as they do not conflict at run time. In this...

متن کامل

Detection of Synchronization Errors through Speculative Lock Elision

The idea of executing sections of code optimistically in parallel in order to increase performance has recently regained popularity in the computer architecture literature. Two papers [6, 7] suggest the speculative elision of lock acquisitions in threaded programs to eliminate unnecessary serialization and to allow the use of more coarse-grained locks without sacrificing performance. These sche...

متن کامل

Distributed Optimistic Concurrency Considered Optimistic

Optimistic concurrency relies on speculative execution, read-write conflict detection, and checkpointrollback techniques to provide a programming model that replaces locks with the abstraction of atomic, isolated execution of critical sections. Previous research has shown that on chip multi-processors, a class of workloads featuring irregular parallelism and rare read-write conflicts can reap s...

متن کامل

Some challenges facing Transactional Memory

Evaluating Transactional Memory: TM’s advantages with respect to locks can be categorized roughly into to two categories: those relating to performance (optimistic execution and fine-grain synchronization) and those relating to programmability (no need to associate a synchronization variable to critical sections, natural composition, fault tolerance, and avoiding priority inversion). To date mu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003